On total colorings of 1-planar graphs
نویسندگان
چکیده
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we confirm the total-coloring conjecture for 1-planar graphs with maximum degree
منابع مشابه
Injective colorings of planar graphs with few colors
An injective coloring of a graph is a vertex coloring where two vertices have distinct colors if a path of length two exists between them. In this paper some results on injective colorings of planar graphs with few colors are presented. We show that all planar graphs of girth ≥19 and maximum degree ∆ are injectively ∆-colorable. We also show that all planar graphs of girth ≥10 are injectively (...
متن کاملPerfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملTotal-Coloring of Plane Graphs with Maximum Degree Nine
The central problem of the total-colorings is the total-coloring conjecture, which asserts that every graph of maximum degree ∆ admits a (∆+2)-total-coloring. Similar to edge-colorings—with Vizing’s edge-coloring conjecture—this bound can be decreased by 1 for plane graphs of higher maximum degree. More precisely, it is known that if ∆ ≥ 10, then every plane graph of maximum degree ∆ is (∆ + 1)...
متن کاملNegative results on acyclic improper colorings
Raspaud and Sopena showed that the oriented chromatic number of a graph with acyclic chromatic number k is at most k2. We prove that this bound is tight for k ≥ 3. We also consider acyclic improper colorings on planar graphs and partial ktrees. Finally, we show that some improper and/or acyclic colorings are NP-complete on restricted subclasses of planar graphs, in particular acyclic 3-colorabi...
متن کاملA note on total colorings of planar graphs without 4-cycles
Let G be a 2-connected planar graph with maximum degree ∆ such that G has no cycle of length from 4 to k, where k ≥ 4. Then the total chromatic number of G is ∆+1 if (∆, k) ∈ {(7, 4), (6, 5), (5, 7), (4, 14)}.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Optim.
دوره 30 شماره
صفحات -
تاریخ انتشار 2015